Traceability of line graphs
نویسندگان
چکیده
منابع مشابه
On Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملTraceability of k-traceable oriented graphs
A digraph of order at least k is k-traceable if each of its subdigraphs of order k is traceable. We note that 2-traceable oriented graphs are tournaments and for k ≥ 3, k-traceable oriented graphs can be regarded as generalized tournaments. We show that for 2 ≤ k ≤ 6 every k-traceable oriented graph is traceable, thus extending the well known fact that every tournament is traceable. This result...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملA Traceability Conjecture for Oriented Graphs
A (di)graph G of order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable graph of order at least 2k − 1 is hamiltonian. The same is true for strong oriented graphs when k = 2, 3, 4, but not when k ≥ 5. However, we conjecture that for k ≥ 2 every k-tracea...
متن کاملTraceability in Small Claw-Free Graphs
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices and a minimal number of edges. This complements a result of Matthews on Hamiltonian graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.10.012